Selection games on hyperspaces

نویسندگان

چکیده

In this paper we connect selection principles on a topological space to corresponding one of its hyperspaces. We unify techniques and generalize theorems from the known results about for common hyperspace constructions. This includes Lj.D.R. Ko\v{c}inac, Z. Li, others. use games work with strategies various strengths these games. The are primarily abstract versions Rothberger, Menger, Hurewicz type, as well countable fan tightness selective separability. constructions that Vietoris Fell topologies, both upper full, generated by ideals closed sets. Using new technique able extend straightforward connections between constructs related those constructs. extension process works regardless length game, kind being performed, or strength strategy considered.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Induced Dynamics on the Hyperspaces

In this paper, we study the dynamics induced by finite commutative relation. We prove that the dynamics generated by such a non-trivial collection cannot be transitive/super-transitive and hence cannot exhibit higher degrees of mixing. As a consequence we establish that the dynamics induced by such a collection on the hyperspace endowedwith any admissible hit andmiss topology cannot be transiti...

متن کامل

Metrics on Hyperspaces : a Practical Approach

We present several new distance functions on hyperspaces and investigate their properties, relative to some natural application considerations.

متن کامل

On the Commutability between Hyperspaces and Subspaces

We study the problem of when the hyperspace CL(A) of a subspace A of a space X is canonically representable as a subspace of the hyperspace CL(X), where both CL(A) and CL(X) are endowed with one of the following hypertopologies: Fell, Wijsman, d-proximal, Hausdorff, locally finite, proximal

متن کامل

Evolutionary games on cycles with strong selection.

Evolutionary games on graphs describe how strategic interactions and population structure determine evolutionary success, quantified by the probability that a single mutant takes over a population. Graph structures, compared to the well-mixed case, can act as amplifiers or suppressors of selection by increasing or decreasing the fixation probability of a beneficial mutant. Properties of the ass...

متن کامل

Equilibrium Selection in Experimental Games on Networks

We study behavior and equilibrium selection in experimental network games. We vary two important factors: (a) actions are either strategic substitutes or strategic complements, and (b) subjects have either complete or incomplete information about the structure of a random network. Play conforms strongly to the theoretical predictions, providing an impressive behavioral confirmation of the Galeo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Topology and its Applications

سال: 2021

ISSN: ['1879-3207', '0166-8641']

DOI: https://doi.org/10.1016/j.topol.2021.107771